Splitting trees at vertices
نویسندگان
چکیده
منابع مشابه
Splitting trees at vertices
We present tight bounds on splitting trees into “small” subtrees.
متن کاملSplitting trees with neutral mutations at birth
We consider a population model where individuals behave independently from each other and whose genealogy is described by a chronological tree called splitting tree. The individuals have i.i.d. (non-exponential) lifetime durations and give birth at constant rate to clonal or mutant children in an infinitely many alleles model with neutral mutations. First, to study the allelic partition of the ...
متن کاملTrees through specified vertices
We prove a conjecture of Horak that can be thought of as an extension of classical results including Dirac’s theorem on the existence of Hamiltonian cycles. Namely, we prove for 1 ≤ k ≤ n − 2 if G is a connected graph with A ⊂ V (G) such that dG(v) ≥ k for all v ∈ A, then there exists a subtree T of G such that V (T ) ⊃ A and dT (v) ≤ ⌈ n−1 k ⌉ for all v ∈ A.
متن کاملSplitting trees
Splitting a tree is defined as removing all edges of a chain and disconnecting one from the other edges incident with that chain. Splitting a forest is simultaneously splitting each of its non-trivial trees. The splitting number a(T) of a tree T is the minimum number of successive forest splittings which lead to deletion of all of T’s edges. An O(N) algorithm is proposed to get an upper bound c...
متن کاملConnecting Vertices by Independent Trees
We study the paramereteized complexity of the following connectivity problem. For a vertex subset U of a graph G, trees T1, . . . , Ts of G are completely independent spanning trees of U if each of them contains U , and for every two distinct vertices u, v ∈ U , the paths from u to v in T1, . . . , Ts are pairwise vertex disjoint except for end-vertices u and v. Then for a given s ≥ 2 and a par...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Discrete Mathematics
سال: 2011
ISSN: 0012-365X
DOI: 10.1016/j.disc.2010.09.024